Coding for Interactive Communication Correcting Insertions and Deletions
نویسندگان
چکیده
منابع مشابه
Codes for Correcting a Burst of Deletions or Insertions
This paper studies codes which correct bursts of deletions. Namely, a binary code will be called a b-burst-correcting code if it can correct a deletion of any b consecutive bits. While the lower bound on the redundancy of such codes was shown by Levenshtein to be asymptotically log(n) + b− 1, the redundancy of the best code construction by Cheng et al. is b(log(n/b+1)). In this paper, we close ...
متن کاملSynchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions
We present many new results related to reliable (interactive) communication over insertiondeletion channels. Synchronization errors, such as insertions and deletions, strictly generalize the usual symbol corruption errors and are much harder to protect against. We show how to hide the complications of synchronization errors in many applications by introducing very general channel simulations wh...
متن کاملCorrecting Two Deletions and Insertions in Racetrack Memory
Racetrack memory is a non-volatile memory engineered to provide both high density and low latency, that is subject to synchronization or shift errors. This paper describes a fast coding solution, in which “delimiter bits” assist in identifying the type of shift error, and easily implementable graph-based codes are used to correct the error, once identified. A code that is able to detect and cor...
متن کاملAsymptotically Good Codes Correcting Insertions, Deletions, and Transpositions (Preliminary Version)
We present simple, polynomial-time encodable and decodable codes which are asymptotically good for channels allowing insertions, deletions and transpositions. As a corollary, they achieve exponential error probability in a stochastic model of insertion-deletion.
متن کاملCoding for interactive communication
Let the input to a computation problem be split between two processors connected by a commu nication link and let an interactive protocol be known by which on any input the processors can solve the problem using no more than T transmissions of bits between them provided the channel is noiseless in each direction We study the following question if in fact the channel is noisy what is the e ect u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2017
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2017.2734881